Efficient Modular Exponentiation Architectures for RSA Algorithm
نویسنده
چکیده
-Cryptosystems are used to send confidential messages in secure manner. The most important and efficient type of cryptosystem is RSA. RSA is used in various sectors such as Bank security and Internet protection. One of the various steps involved in RSA is Modular exponentiation, which is used in both Encryption and Decryption. It takes high memory and computation time of algorithm. In order to reduce the computation time of algorithm, the Modular exponentiation complexity is reduced. In this paper, we explain efficient novel Modular exponentiation. This is done by FPGA implementation using ZedBoard and comparing them with the previous methods. Keywords--RSA cryptosystems; Modular Exponentiation; ASIC and FPGA implementation.
منابع مشابه
Tabulated Modular Exponentiation (TME) Algorithm for Enhancing RSA Public Key Encryption Speed
Improving software algorithms are not easy task, especially for increasing operating speed, and reducing complexity. Different algorithms implemented in cryptosystems used the exponentiation modular arithmetic, however, they suffer very long time complexity. Therefore, faster algorithms are strongly sought. This paper provides fast algorithms for modular multiplication and exponentiation that a...
متن کاملAn Abstract of the Thesis of High-speed Algorithms & Architectures for Number-theoretic Cryptosystems
approved: C etin K. Ko c Computer and network security systems rely on the privacy and authenticity of information, which requires implementation of cryptographic functions. Software implementations of these functions are often desired because of their exibility and cost e ectiveness. In this study, we concentrate on developing high-speed and area-e cient modular multiplication and exponentiati...
متن کاملTwo systolic architectures for modular multiplication
This article presents two systolic architectures to speed up the computation of modular multiplication in RSA cryptosystems. In the double-layer architecture, the main operation of Montgomery's algorithm is partitioned into two parallel operations after using the precomputation of the quotient bit. In the non-interlaced architecture, we eliminate the one-clock-cycle gap between iterations by pa...
متن کاملAn efficient VLSI architecture for RSA public-key cryptosystem
In this paper, a new efficient VLSI archtecture to compute RSA public-key cryptosystem is proposed. The modified H-algorithm is applied to fmd the modular exponentiation. By this modified Halgorithm, the modular multiplication steps reduced about 5dl8. For the modular multiplication the L-algorithm (LSB first) is used. In the architecture of the modular multiplication the iteration times are on...
متن کاملHigh-Radix Montgomery Modular Exponentiation on Reconfigurable Hardware
It is widely recognized that security issues will play a crucial role in the majority of future computer and communication systems. Central tools for achieving system security are cryptographic algorithms. This contribution proposes arithmetic architectures which are optimized for modern field programmable gate arrays (FPGAs). The proposed architectures perform modular exponentiation with very ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016